Generating functions and Wilf equivalence for generalized interval embeddings

نویسندگان

  • Russell Chamberlain
  • Garner Cochran
  • Sam Ginsburg
  • Brian K. Miceli
  • Manda Riehl
  • Chi Zhang
چکیده

In 1999 in [J. Difference Equ. Appl. 5, 355–377], Noonan and Zeilberger extended the Goulden-Jackson Cluster Method to find generating functions of word factors. Then in 2009 in [Electron. J. Combin. 16(2), RZZ], Kitaev, Liese, Remmel and Sagan found generating functions for word embeddings and proved several results on Wilf-equivalence in that setting. In this article, the authors focus on generalized interval embeddings, which encapsulate both factors and embeddings, as well as the “space between” these two ideas. The authors present some results in the most general case of interval embeddings. Two special cases of interval embeddings are also discussed, as well as their relationship to results in previous works in the area of pattern avoidance in words.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wilf Equivalence in Interval Embeddings

Consider the alphabet A and define A∗ as the set of words over A. Define a vector of sequences of subsets of N as ~u = (u1, u2, . . . , uk). Consider a word w ∈ A∗. Define their to be an embedding of ~u in w, ~u ≤ w if there is some i such that, wi ∈ uj , wi+1 ∈ uj+1, . . . wi+k−1 ∈ uj+k−1. Define a word that avoids the vector ~u as a word where there is no such i, such that wi ∈ uj , wi+1 ∈ uj...

متن کامل

Generating functions for Wilf equivalence under generalized factor order

Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on words comprised of letters from a partially ordered set (P,≤P) by setting u ≤P w if there is a subword v of w of the same length as u such that the i-th character of v is greater than or equal to the i-th character of u for all i. This subword v is called an embedding of u into w. Generalized factor order is related t...

متن کامل

Recurrence Relations for Moment Generating Functions of Generalized Order Statistics Based on Doubly Truncated Class of Distributions

In this paper, we derived recurrence relations for joint moment generating functions of nonadjacent generalized order statistics (GOS) of random samples drawn from doubly truncated class of continuous distributions. Recurrence relations for joint moments of nonadjacent GOS (ordinary order statistics (OOS) and k-upper records (k-RVs) as special cases) are obtained. Single and product moment gene...

متن کامل

Shape-wilf-equivalences for Vincular Patterns

We extend the notion of shape-Wilf-equivalence to vincular patterns (also known as “generalized patterns” or “dashed patterns”). First we introduce a stronger equivalence on patterns which we call filling-shape-Wilfequivalence. When vincular patterns α and β are filling-shape-Wilf-equivalent, we prove that α⊕ σ and β ⊕ σ must also be filling-shape-Wilf-equivalent. We also discover two new pairs...

متن کامل

Avoiding Patterns of Length Three in Compositions and Multiset Permutations

We find generating functions for the number of compositions avoiding a single pattern or a pair of patterns of length three on the alphabet {1, 2} and determine which of them are Wilf-equivalent on compositions. We also derive the number of permutations of a multiset which avoid these same patterns and determine the Wilf-equivalence of these patterns on permutations of multisets. 2000 Mathemati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2016